Online Graph Colouring
نویسنده
چکیده
This paper considers the problem of online graph colouring. An algorithm for vertex-colouring graphs is said to be online if each vertex is irrevocably assigned a colour before later vertices are considered. We first introduce the problem formally and define a perfomance metric to evaluate the success of an online colouring algorithm. Then, several upper and lower bounds are presented on the performance ratio for any algorithm solving the online graph colouring problem. These general bounds are shown to hold even when we relax and vary the conditions of the problem. Next, specific algorithms are presented and analyzed on how they perform in specific cases as well as in the general case. Finally, a discussion of future directions for research is presented.
منابع مشابه
A tight bound for online colouring of disk graphs
We present an improved upper bound on the competitiveness of the online colouring algorithm First-Fit in disk graphs, which are graphs representing overlaps of disks on the plane. We also show that this bound is best possible for deterministic online colouring algorithms that do not use the disk representation of the input graph. We also present a related new lower bound for unit disk graphs. c...
متن کاملOn-Line List Colouring of Graphs
This paper studies on-line list colouring of graphs. It is proved that the online choice number of a graph G on n vertices is at most χ(G) ln n + 1, and the on-line b-choice number of G is at most eχ(G)−1 e−1 (b − 1 + lnn) + b. Suppose G is a graph with a given χ(G)-colouring of G. Then for any (χ(G) ln n + 1)-assignment L of G, we give a polynomial time algorithm which constructs an L-colourin...
متن کاملList Colouring Big Graphs On-Line
In this paper, we investigate the problem of graph list colouring in the on-line setting. We provide several results on paintability of graphs in the model introduced by Schauz [13] and Zhu [19]. We prove that the on-line version of Ohba’s conjecture is true in the class of planar graphs. We also consider several alternate on-line list colouring models.
متن کاملAbout randomised distributed graph colouring and graph partition algorithms
Article history: Received 14 April 2010 Revised 20 June 2010 Available online 1 August 2010
متن کاملGraph Colouring Problems and Their Applications in Scheduling
Graph colouring and its generalizations are useful tools in modelling a wide variety of scheduling and assignment problems. In this paper we review several variants of graph colouring, such as precolouring extension, list colouring, multicolouring, minimum sum colouring, and discuss their applications in scheduling.
متن کامل